Constant Compression and Random Weights
نویسندگان
چکیده
منابع مشابه
Constant compression and random weights
We introduce a new characterization of left-r.e. Martin-Löf random reals: a real is Martin-Löf random and recursively approximable from below if and only if it equals the weight of the compressible strings for some universal prefix-free machine. For sufficiently large intervals [a, b), the weight of strings which are a-compressible strings but not b-compressible is a left-r.e. Martin-Löf random...
متن کاملDavenport constant with weights
For the cyclic group G = Z/nZ and any non-empty A ∈ Z. We define the Davenport constant of G with weight A, denoted by DA(n), to be the least natural number k such that for any sequence (x1, · · · , xk) with xi ∈ G, there exists a non-empty subsequence (xj1, · · · , xjl) and a1, · · · , al ∈ A such that ∑l i=1 aixji = 0. Similarly, we define the constant EA(n) to be the least t ∈ N such that fo...
متن کاملOn Random Weights and Unsupervised Feature Learning
Recently two anomalous results in the literature have shown that certain feature learning architectures can yield useful features for object recognition tasks even with untrained, random weights. In this paper we pose the question: why do random weights sometimes do so well? Our answer is that certain convolutional pooling architectures can be inherently frequency selective and translation inva...
متن کاملDavenport constant with weights and some related questions, II
Let n ∈ N and let A ⊆ Z/nZ be such that A does not contain 0 and it is non–empty. Generalizing a well known constant, EA(n) is defined to be the least t ∈ N such that for all sequences (x1, . . . , xt) ∈ Z, there exist indices j1, . . . , jn ∈ N, 1 ≤ j1 < · · · < jn ≤ t, and (θ1, · · · ,θn) ∈ A with ∑n i=1 θixji ≡ 0 (mod n). Similarly, for any such set A, we define the Davenport Constant of Z/n...
متن کاملRecursive random trees with product-form random weights
We consider growing random recursive trees in random environment, in which at each step a new vertex is attached according to a probability distribution that assigns the tree vertices masses proportional to their random weights. The main aim of the paper is to study the asymptotic behavior of the mean numbers of outgoing vertices as the number of steps tends to infinity, under the assumption th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computability
سال: 2012
ISSN: 2211-3568
DOI: 10.3233/com-12011